Using LLL-Reduction for Solving RSA and Factorization Problems

نویسنده

  • Alexander May
چکیده

25 years ago, Lenstra, Lenstra and Lovász presented their celebrated LLL lattice reduction algorithm. Among the various applications of the LLL algorithm is a method due to Coppersmith for finding small roots of polynomial equations. We give a survey of the applications of this root finding method to the problem of inverting the RSA function and the factorization problem. As we will see, most of the results are of a dual nature, they can either be interpreted as cryptanalytic results or as hardness/security results.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using LLL-Reduction for Solving RSA and Factorization Problems: A Survey

25 years ago, Lenstra, Lenstra and Lovasz presented their celebrated LLL lattice reduction algorithm. Among the various applications of the LLL algorithm is a method due to Coppersmith for finding small roots of polynomial equations. We give a survey of the applications of this root finding method to the problem of inverting the RSA function and the factorization problem. As we will see, most o...

متن کامل

Deterministic Polynomial Time Equivalence Between Factoring and Key-Recovery Attack on Takagi's RSA

For RSA, May showed a deterministic polynomial time equivalence of computing d to factoring N(= pq). On the other hand, Takagi showed a variant of RSA such that the decryption algorithm is faster than the standard RSA, where N = pq while ed = 1 mod (p−1)(q−1). In this paper, we show that a deterministic polynomial time equivalence also holds in this variant. The coefficient matrix T to which LL...

متن کامل

A Simple Improvement for Integer Factorizations with Implicit Hints

In this paper, we describe an improvement of integer factorization of k RSA moduli Ni = piqi (1 ≤ i ≤ k) with implicit hints, namely all pi share their t least significant bits. May et al. reduced this problem to finding a shortest (or a relatively short) vector in the lattice of dimension k obtained from a given system of k RSAmoduli, for which they applied Gaussian reduction or the LLL algori...

متن کامل

The Mathematical Cryptography of the RSA Cryptosystem

Invented in 1977 by Rivest, Shamir and Adleman, the RSA cryptosystem has played a very important role in the development of modern cryptography. Its various applications in industry, Internet, banking, online shopping, cell phones, smart cards, secure information transfers and electronic signatures have made RSA a standard at the heart of modern technologies. This chapter explores the mathemati...

متن کامل

New weak RSA keys

Let N = pq be an RSA modulus with q < p < 2q. In this paper, we analyze the security of RSA with the class of the exponents e satisfying an equation eX −NY = ap + bq + Z with |a| < q, b = ⌊ ap q ⌋ , X < N 3|ap + bq| and |Z| < |ap− bq| 3|ap + bq| N 1 4 , where bxc is the greatest integer less than or equal to x. Using the continued fraction algorithm and Coppersmith’s lattice reduction method fo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010